0.07/0.12	% Problem    : Vampire---4.8_5951 : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : run_E %s %d THM
0.13/0.35	% Computer : n012.cluster.edu
0.13/0.35	% Model    : x86_64 x86_64
0.13/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.35	% Memory   : 8042.1875MB
0.13/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.35	% CPULimit   : 1440
0.13/0.35	% WCLimit    : 180
0.13/0.35	% DateTime   : Mon Jul  3 12:43:22 EDT 2023
0.13/0.35	% CPUTime    : 
0.20/0.48	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.Cd2QSpRGRW/Vampire---4.8_5951
0.20/0.48	# Version: 3.1pre001-ho
0.20/0.53	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.53	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.53	# Starting post_as_ho12 with 180s (1) cores
0.20/0.53	# Starting new_bool_9 with 180s (1) cores
0.20/0.53	# Starting post_as_ho1 with 180s (1) cores
0.20/0.53	# Starting post_as_ho4 with 180s (1) cores
0.20/0.53	# Starting post_as_ho2 with 180s (1) cores
0.20/0.53	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.53	# Starting full_lambda_10 with 180s (1) cores
0.20/0.53	# Starting new_ho_8 with 180s (1) cores
0.20/0.53	# post_as_ho1 with pid 6300 completed with status 0
0.20/0.53	# Result found by post_as_ho1
0.20/0.53	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.53	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.53	# Starting post_as_ho12 with 180s (1) cores
0.20/0.53	# Starting new_bool_9 with 180s (1) cores
0.20/0.53	# Starting post_as_ho1 with 180s (1) cores
0.20/0.53	# No SInE strategy applied
0.20/0.53	# Search class: HGHNF-FFSF11-SSSFFMBN
0.20/0.53	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.53	# Starting post_as_ho2 with 98s (1) cores
0.20/0.53	# post_as_ho2 with pid 6308 completed with status 9
0.20/0.53	# Starting post_as_ho1 with 19s (1) cores
0.20/0.53	# post_as_ho1 with pid 6317 completed with status 9
0.20/0.53	# Starting new_bool_9 with 17s (1) cores
0.20/0.53	# new_bool_9 with pid 6323 completed with status 9
0.20/0.53	# Starting new_ho_8 with 17s (1) cores
0.20/0.53	# new_ho_8 with pid 6330 completed with status 0
0.20/0.53	# Result found by new_ho_8
0.20/0.53	# Preprocessing class: HSSSSMSSSSSNSSA.
0.20/0.53	# Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.53	# Starting post_as_ho12 with 180s (1) cores
0.20/0.53	# Starting new_bool_9 with 180s (1) cores
0.20/0.53	# Starting post_as_ho1 with 180s (1) cores
0.20/0.53	# No SInE strategy applied
0.20/0.53	# Search class: HGHNF-FFSF11-SSSFFMBN
0.20/0.53	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.53	# Starting post_as_ho2 with 98s (1) cores
0.20/0.53	# post_as_ho2 with pid 6308 completed with status 9
0.20/0.53	# Starting post_as_ho1 with 19s (1) cores
0.20/0.53	# post_as_ho1 with pid 6317 completed with status 9
0.20/0.53	# Starting new_bool_9 with 17s (1) cores
0.20/0.53	# new_bool_9 with pid 6323 completed with status 9
0.20/0.53	# Starting new_ho_8 with 17s (1) cores
0.20/0.53	# Preprocessing time       : 0.001 s
0.20/0.53	# Presaturation interreduction done
0.20/0.53	
0.20/0.53	# Proof found!
0.20/0.53	# SZS status Theorem
0.20/0.53	# SZS output start CNFRefutation
0.20/0.53	thf(decl_22, type, cS: $i > $i).
0.20/0.53	thf(decl_23, type, cQ: $i > $i).
0.20/0.53	thf(decl_24, type, cR: $i > $i > $o).
0.20/0.53	thf(decl_25, type, esk1_1: $i > $i).
0.20/0.53	thf(decl_26, type, esk2_1: $i > $i).
0.20/0.53	thf(decl_27, type, esk3_1: ($i > $o) > $i).
0.20/0.53	thf(cEO1, conjecture, (![X1:$i]:((~(?[X2:$i]:((cR @ (cS @ X1) @ (cQ @ X2))))<=>?[X3:$i]:((cR @ X1 @ (cQ @ X3)))))=>?[X4:$i > $o]:(![X1:$i]:((~((X4 @ (cS @ X1)))<=>(X4 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.Cd2QSpRGRW/Vampire---4.8_5951', cEO1)).
0.20/0.53	thf(c_0_1, negated_conjecture, ~((![X1:$i]:((~(?[X2:$i]:((cR @ (cS @ X1) @ (cQ @ X2))))<=>?[X3:$i]:((cR @ X1 @ (cQ @ X3)))))=>?[X4:$i > $o]:(![X1:$i]:((~(X4 @ (cS @ X1))<=>(X4 @ X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEO1])])).
0.20/0.53	thf(c_0_2, negated_conjecture, ![X10:$i, X13:$i, X14:$i, X15:$i, X16:$i > $o]:(((((cR @ (cS @ X10) @ (cQ @ (esk1_1 @ X10)))|(cR @ X10 @ (cQ @ (esk2_1 @ X10))))&(~(cR @ X13 @ (cQ @ X14))|~(cR @ (cS @ X13) @ (cQ @ X15))))&(((X16 @ (cS @ (esk3_1 @ X16)))|~(X16 @ (esk3_1 @ X16)))&(~(X16 @ (cS @ (esk3_1 @ X16)))|(X16 @ (esk3_1 @ X16)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.20/0.53	thf(c_0_3, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((~((cR @ X1 @ (cQ @ X2)))|~((cR @ (cS @ X1) @ (cQ @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.53	thf(c_0_4, negated_conjecture, ![X1:$i]:(((cR @ (cS @ X1) @ (cQ @ (esk1_1 @ X1)))|(cR @ X1 @ (cQ @ (esk2_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.53	thf(c_0_5, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk3_1 @ X4))|~((X4 @ (cS @ (esk3_1 @ X4)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.53	thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:(((cR @ X1 @ (cQ @ (esk2_1 @ X1)))|~((cR @ X1 @ (cQ @ X2))))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.20/0.53	thf(c_0_7, negated_conjecture, ![X1:$i]:(~((cR @ (cS @ (esk3_1 @ (^[Z0/* 3 */:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0))))))) @ (cQ @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_3])).
0.20/0.53	thf(c_0_8, negated_conjecture, ![X4:$i > $o]:(((X4 @ (cS @ (esk3_1 @ X4)))|~((X4 @ (esk3_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.53	thf(c_0_9, negated_conjecture, ~((cR @ (esk3_1 @ (^[Z0/* 3 */:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))) @ (cQ @ (esk2_1 @ (esk3_1 @ (^[Z0/* 3 */:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))))))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
0.20/0.53	thf(c_0_10, negated_conjecture, ![X1:$i]:(~((cR @ (esk3_1 @ (^[Z0/* 3 */:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))) @ (cQ @ X1)))), inference(spm,[status(thm)],[c_0_9, c_0_6])).
0.20/0.53	thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i]:(((cR @ X1 @ (cQ @ (esk2_1 @ X1)))|~((cR @ (cS @ (cS @ X1)) @ (cQ @ X2))))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.20/0.53	thf(c_0_12, negated_conjecture, ![X1:$i]:(~((cR @ (cS @ (cS @ (esk3_1 @ (^[Z0/* 3 */:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))))) @ (cQ @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
0.20/0.53	thf(c_0_13, negated_conjecture, ![X1:$i]:(((cR @ (cS @ X1) @ (cQ @ (esk2_1 @ (cS @ X1))))|(cR @ X1 @ (cQ @ (esk2_1 @ X1))))), inference(spm,[status(thm)],[c_0_11, c_0_4])).
0.20/0.53	thf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_7]), ['proof']).
0.20/0.53	# SZS output end CNFRefutation
0.20/0.53	# Parsed axioms                        : 4
0.20/0.53	# Removed by relevancy pruning/SinE    : 0
0.20/0.53	# Initial clauses                      : 7
0.20/0.53	# Removed in clause preprocessing      : 3
0.20/0.53	# Initial clauses in saturation        : 4
0.20/0.53	# Processed clauses                    : 112
0.20/0.53	# ...of these trivial                  : 0
0.20/0.53	# ...subsumed                          : 78
0.20/0.53	# ...remaining for further processing  : 34
0.20/0.53	# Other redundant clauses eliminated   : 0
0.20/0.53	# Clauses deleted for lack of memory   : 0
0.20/0.53	# Backward-subsumed                    : 1
0.20/0.53	# Backward-rewritten                   : 0
0.20/0.53	# Generated clauses                    : 366
0.45/0.53	# ...of the previous two non-redundant : 357
0.45/0.53	# ...aggressively subsumed             : 0
0.45/0.53	# Contextual simplify-reflections      : 1
0.45/0.53	# Paramodulations                      : 364
0.45/0.53	# Factorizations                       : 0
0.45/0.53	# NegExts                              : 0
0.45/0.53	# Equation resolutions                 : 2
0.45/0.53	# Total rewrite steps                  : 0
0.45/0.53	# Propositional unsat checks           : 0
0.45/0.53	#    Propositional check models        : 0
0.45/0.53	#    Propositional check unsatisfiable : 0
0.45/0.53	#    Propositional clauses             : 0
0.45/0.53	#    Propositional clauses after purity: 0
0.45/0.53	#    Propositional unsat core size     : 0
0.45/0.53	#    Propositional preprocessing time  : 0.000
0.45/0.53	#    Propositional encoding time       : 0.000
0.45/0.53	#    Propositional solver time         : 0.000
0.45/0.53	#    Success case prop preproc time    : 0.000
0.45/0.53	#    Success case prop encoding time   : 0.000
0.45/0.53	#    Success case prop solver time     : 0.000
0.45/0.53	# Current number of processed clauses  : 29
0.45/0.53	#    Positive orientable unit clauses  : 0
0.45/0.53	#    Positive unorientable unit clauses: 0
0.45/0.53	#    Negative unit clauses             : 5
0.45/0.53	#    Non-unit-clauses                  : 24
0.45/0.53	# Current number of unprocessed clauses: 249
0.45/0.53	# ...number of literals in the above   : 479
0.45/0.53	# Current number of archived formulas  : 0
0.45/0.53	# Current number of archived clauses   : 5
0.45/0.53	# Clause-clause subsumption calls (NU) : 302
0.45/0.53	# Rec. Clause-clause subsumption calls : 302
0.45/0.53	# Non-unit clause-clause subsumptions  : 71
0.45/0.53	# Unit Clause-clause subsumption calls : 34
0.45/0.53	# Rewrite failures with RHS unbound    : 0
0.45/0.53	# BW rewrite match attempts            : 0
0.45/0.53	# BW rewrite match successes           : 0
0.45/0.53	# Condensation attempts                : 0
0.45/0.53	# Condensation successes               : 0
0.45/0.53	# Termbank termtop insertions          : 53476
0.45/0.53	
0.45/0.53	# -------------------------------------------------
0.45/0.53	# User time                : 0.030 s
0.45/0.53	# System time              : 0.012 s
0.45/0.53	# Total time               : 0.042 s
0.45/0.53	# Maximum resident set size: 1812 pages
0.45/0.53	
0.45/0.53	# -------------------------------------------------
0.45/0.53	# User time                : 0.030 s
0.45/0.53	# System time              : 0.015 s
0.45/0.53	# Total time               : 0.045 s
0.45/0.53	# Maximum resident set size: 1704 pages
0.45/0.53	% E---3.1 exiting
0.45/0.53	EOF